398 research outputs found
Decrement Operators in Belief Change
While research on iterated revision is predominant in the field of iterated
belief change, the class of iterated contraction operators received more
attention in recent years. In this article, we examine a non-prioritized
generalisation of iterated contraction. In particular, the class of weak
decrement operators is introduced, which are operators that by multiple steps
achieve the same as a contraction. Inspired by Darwiche and Pearl's work on
iterated revision the subclass of decrement operators is defined. For both,
decrement and weak decrement operators, postulates are presented and for each
of them a representation theorem in the framework of total preorders is given.
Furthermore, we present two sub-types of decrement operators
Semi-automatic assessment of unrestrained Java code: a Library, a DSL, and a workbench to assess exams and exercises
© ACM 2015. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in http://dx.doi.org/10.1145/2729094.2742615Automated marking of multiple-choice exams is of great interest
in university courses with a large number of students.
For this reason, it has been systematically implanted in almost
all universities. Automatic assessment of source code
is however less extended. There are several reasons for that.
One reason is that almost all existing systems are based on
output comparison with a gold standard. If the output is the
expected, the code is correct. Otherwise, it is reported as
wrong, even if there is only one typo in the code. Moreover,
why it is wrong remains a mystery. In general, assessment
tools treat the code as a black box, and they only assess the
externally observable behavior. In this work we introduce a
new code assessment method that also verifies properties of
the code, thus allowing to mark the code even if it is only
partially correct. We also report about the use of this system
in a real university context, showing that the system
automatically assesses around 50% of the work.This work has been partially supported by the EU (FEDER) and the Spanish Ministerio de EconomÃay Competitividad (SecretarÃa de Estado de Investigación, Desarrollo e Innovación) under grant TIN2013-44742-C4-1-R and by the Generalitat Valenciana under grant PROMETEOII2015/013. David Insa was partially supported by the Spanish Ministerio de Educación under FPU grant AP2010-4415.Insa Cabrera, D.; Silva, J. (2015). Semi-automatic assessment of unrestrained Java code: a Library, a DSL, and a workbench to assess exams and exercises. ACM. https://doi.org/10.1145/2729094.2742615SK. A Rahman and M. Jan Nordin. A review on the static analysis approach in the automated programming assessment systems. In National Conference on Programming 07, 2007.K. Ala-Mutka. A survey of automated assessment approaches for programming assignments. In Computer Science Education, volume 15, pages 83--102, 2005.C. Beierle, M. Kula, and M. Widera. Automatic analysis of programming assignments. In Proc. der 1. E-Learning Fachtagung Informatik (DeLFI '03), volume P-37, pages 144--153, 2003.J. Biggs and C. Tang. Teaching for Quality Learning at University : What the Student Does (3rd Edition). In Open University Press, 2007.P. Denny, A. Luxton-Reilly, E. Tempero, and J. Hendrickx. CodeWrite: Supporting student-driven practice of java. In Proceedings of the 42nd ACM technical symposium on Computer science education, pages 09--12, 2011.R. Hendriks. Automatic exam correction. 2012.P. Ihantola, T. Ahoniemi, V. Karavirta, and O. Seppala. Review of recent systems for automatic assessment of programming assignments. In Proceedings of the 10th Koli Calling International Conference on Computing Education Research, pages 86--93, 2010.H. Kitaya and U. Inoue. An online automated scoring system for Java programming assignments. In International Journal of Information and Education Technology, volume 6, pages 275--279, 2014.M.-J. Laakso, T. Salakoski, A. Korhonen, and L. Malmi. Automatic assessment of exercises for algorithms and data structures - a case study with TRAKLA2. In Proceedings of Kolin Kolistelut/Koli Calling - Fourth Finnish/Baltic Sea Conference on Computer Science Education, pages 28--36, 2004.Y. Liang, Q. Liu, J. Xu, and D. Wang. The recent development of automated programming assessment. In Computational Intelligence and Software Engineering, pages 1--5, 2009.K. A. Naudé, J. H. Greyling, and D. Vogts. Marking student programs using graph similarity. In Computers & Education, volume 54, pages 545--561, 2010.A. Pears, S. Seidman, C. Eney, P. Kinnunen, and L. Malmi. Constructing a core literature for computing education research. In SIGCSE Bulletin, volume 37, pages 152--161, 2005.F. Prados, I. Boada, J. Soler, and J. Poch. Automatic generation and correction of technical exercices. In International Conference on Engineering and Computer Education (ICECE 2005), 2005.M. Supic, K. Brkic, T. Hrkac, Z. Mihajlovic, and Z. Kalafatic. Automatic recognition of handwritten corrections for multiple-choice exam answer sheets. In Information and Communication Technology, Electronics and Microelectronics (MIPRO), pages 1136--1141, 2014.S. Tung, T. Lin, and Y. Lin. An exercise management system for teaching programming. In Journal of Software, 2013.T. Wang, X. Su, Y. Wang, and P. Ma. Semantic similarity-based grading of student programs. In Information and Software Technology, volume 49, pages 99--107, 2007
TWAM: A Certifying Abstract Machine for Logic Programs
Type-preserving (or typed) compilation uses typing derivations to certify
correctness properties of compilation. We have designed and implemented a
type-preserving compiler for a simply-typed dialect of Prolog we call T-Prolog.
The crux of our approach is a new certifying abstract machine which we call the
Typed Warren Abstract Machine (TWAM). The TWAM has a dependent type system
strong enough to specify the semantics of a logic program in the logical
framework LF. We present a soundness metatheorem which constitutes a partial
correctness guarantee: well-typed programs implement the logic program
specified by their type. This metatheorem justifies our design and
implementation of a certifying compiler from T-Prolog to TWAM.Comment: 41 pages, under submission to ACM Transactions on Computational Logi
FAK Inhibition Decreases Hepatoblastoma Survival Both In Vitro and In Vivo
AbstractHepatoblastoma is the most frequently diagnosed liver tumor of childhood, and children with advanced, metastatic or relapsed disease have a disease-free survival rate under 50%. Focal adhesion kinase (FAK) is a nonreceptor tyrosine kinase that is important in many facets of tumor development and progression. FAK has been found in other pediatric solid tumors and in adult hepatocellular carcinoma, leading us to hypothesize that FAK would be present in hepatoblastoma and would impact its cellular survival. In the current study, we showed that FAK was present and phosphorylated in human hepatoblastoma tumor specimens. We also examined the effects of FAK inhibition upon hepatoblastoma cells using a number of parallel approaches to block FAK including RNAi and small molecule FAK inhibitors. FAK inhibition resulted in decreased cellular survival, invasion, and migration and increased apoptosis. Further, small molecule inhibition of FAK led to decreased tumor growth in a nude mouse xenograft model of hepatoblastoma. The findings from this study will help to further our understanding of the regulation of hepatoblastoma tumorigenesis and may provide desperately needed novel therapeutic strategies and targets for aggressive, recurrent, or metastatic hepatoblastomas
Practical Low Data-Complexity Subspace-Trail Cryptanalysis of Round-Reduced PRINCE
Subspace trail cryptanalysis is a very recent new cryptanalysis
technique, and includes differential, truncated differential,
impossible differential, and integral attacks as special cases.
In this paper, we consider PRINCE, a widely analyzed block cipher
proposed in 2012.
After the identification of a 2.5 rounds subspace trail of PRINCE, we
present several (truncated differential) attacks up to 6 rounds of PRINCE. This includes a very practical attack with the lowest data complexity of only 8 plaintexts for 4 rounds, which co-won the final round of the PRINCE challenge in the 4-round chosen-plaintext category.
The attacks have been verified using a C implementation.
Of independent interest, we consider a variant of PRINCE in which ShiftRows and MixLayer operations are exchanged in position. In particular, our result shows that the position of ShiftRows and MixLayer operations influences the security of PRINCE.
The same analysis applies to follow-up designs inspired by PRINCE
Second-Generation Large Civil Tiltrotor 7- by 10-Foot Wind Tunnel Test Data Report
An approximately 6-percent scale model of the NASA Second-Generation Large Civil Tiltrotor (LCTR2) Aircraft was tested in the U.S. Army 7- by 10-Foot Wind Tunnel at NASA Ames Research Center January 4 to April 19, 2012, and September 18 to November 1, 2013. The full model was tested, along with modified versions in order to determine the effects of the wing tip extensions and nacelles; the wing was also tested separately in the various configurations. In both cases, the wing and nacelles used were adopted from the U.S. Army High Efficiency Tilt Rotor (HETR) aircraft, in order to limit the cost of the experiment. The full airframe was tested in high-speed cruise and low-speed hover flight conditions, while the wing was tested only in cruise conditions, with Reynolds numbers ranging from 0 to 1.4 million. In all cases, the external scale system of the wind tunnel was used to collect data. Both models were mounted to the scale using two support struts attached underneath the wing; the full airframe model also used a third strut attached at the tail. The collected data provides insight into the performance of the preliminary design of the LCTR2 and will be used for computational fluid dynamics (CFD) validation and the development of flight dynamics simulation models
Systematic Construction of Nonlinear Product Attacks on Block Ciphers
A major open problem in block cipher cryptanalysis is discovery of new invariant properties of complex type. Recent papers show that this can be achieved for SCREAM, Midori64, MANTIS-4, T-310 or for DES with modified S-boxes. Until now such attacks are hard to find and seem to happen by some sort of incredible coincidence. In this paper we abstract the attack from any particular block cipher. We study these attacks in terms of transformations on multivariate polynomials. We shall demonstrate how numerous variables including key variables may sometimes be eliminated and at the end two very complex Boolean polynomials will become equal. We present a general construction of an attack where multiply all the polynomials lying on one or several cycles. Then under suitable conditions the non-linear functions involved will be eliminated totally. We obtain a periodic invariant property holding for any number of rounds. A major difficulty with invariant attacks is that they typically work only for some keys. In T-310 our attack works for any key and also in spite of the presence of round constants
Boomerang Connectivity Table:A New Cryptanalysis Tool
A boomerang attack is a cryptanalysis framework that regards a block cipher as the composition of two sub-ciphers and builds a particular characteristic for with probability by combining differential characteristics for and with probability and , respectively.
Crucially the validity of this figure is under the assumption that the characteristics for and can be chosen independently. Indeed, Murphy has shown that independently chosen characteristics may turn out to be incompatible. On the other hand, several researchers observed that the probability can be improved to or around the boundary between and by considering a positive dependency of the two characteristics, e.g.~the ladder switch and S-box switch by Biryukov and Khovratovich.
This phenomenon was later formalised by Dunkelman et al.~as a sandwich attack that regards as , where satisfies some differential propagation among four texts with probability , and the entire probability is .
In this paper, we revisit the issue of dependency of two characteristics in , and propose a new tool called Boomerang Connectivity Table (BCT), which evaluates in a systematic and easy-to-understand way when is composed of a single S-box layer. With the BCT, previous observations on the S-box including the incompatibility, the ladder switch and the S-box switch are represented in a unified manner. Moreover, the BCT can detect a new switching effect, which shows that the probability around the boundary may be even higher than or .
To illustrate the power of the BCT-based analysis, we improve boomerang attacks against Deoxys-BC, and disclose the mechanism behind an unsolved probability amplification for generating a quartet in SKINNY. Lastly, we discuss the issue of searching for S-boxes having good BCT and extending the analysis to modular addition
Co-Localization of the Oncogenic Transcription Factor MYCN and the DNA Methyl Binding Protein MeCP2 at Genomic Sites in Neuroblastoma
MYCN is a transcription factor that is expressed during the development of the neural crest and its dysregulation plays a major role in the pathogenesis of pediatric cancers such as neuroblastoma, medulloblastoma and rhabdomyosarcoma. MeCP2 is a CpG methyl binding protein which has been associated with a number of cancers and developmental disorders, particularly Rett syndrome.Using an integrative global genomics approach involving chromatin immunoprecipitation applied to microarrays, we have determined that MYCN and MeCP2 co-localize to gene promoter regions, as well as inter/intragenic sites, within the neuroblastoma genome (MYCN amplified Kelly cells) at high frequency (70.2% of MYCN sites were also positive for MeCP2). Intriguingly, the frequency of co-localization was significantly less at promoter regions exhibiting substantial hypermethylation (8.7%), as determined by methylated DNA immunoprecipitation (MeDIP) applied to the same microarrays. Co-immunoprecipitation of MYCN using an anti-MeCP2 antibody indicated that a MYCN/MeCP2 interaction occurs at protein level. mRNA expression profiling revealed that the median expression of genes with promoters bound by MYCN was significantly higher than for genes bound by MeCP2, and that genes bound by both proteins had intermediate expression. Pathway analysis was carried out for genes bound by MYCN, MeCP2 or MYCN/MeCP2, revealing higher order functions.Our results indicate that MYCN and MeCP2 protein interact and co-localize to similar genomic sites at very high frequency, and that the patterns of binding of these proteins can be associated with significant differences in transcriptional activity. Although it is not yet known if this interaction contributes to neuroblastoma disease pathogenesis, it is intriguing that the interaction occurs at the promoter regions of several genes important for the development of neuroblastoma, including ALK, AURKA and BDNF
- …